/**
 * @description:
 * @Author: wuzhenbin
 * @CreateTime: 2025/2/16
 */
public class leetcode_70 {
    public static void main(String[] args) {

    }

    public int climbStairs(int n) {
        int[] dp = new int[n];
        if (n == 0) {
            return 1;
        }
        if (n == 1) {
            return 1;
        }
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i < n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] ;
        }
        return dp[n-1];
    }
}
